package com.liuwei.spring.cloud.junit.leetcode.dp;

import lombok.extern.slf4j.Slf4j;

/**
 * https://leetcode.cn/problems/minimum-path-sum/description/?envType=study-plan-v2&envId=top-100-liked
 */
@Slf4j
public class MinimumPathSum {

    public static void main(String[] args) {

    }

    /**
     * 二位数组动态规划
     * @param grid
     * @return
     */
    public int minPathSum(int[][] grid) {
        return 0;
    }
}
